0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.37	% Computer   : n005.cluster.edu
0.15/0.37	% Model      : x86_64 x86_64
0.15/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.37	% Memory     : 8042.1875MB
0.15/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.37	% CPULimit   : 1200
0.15/0.37	% WCLimit    : 120
0.15/0.37	% DateTime   : Tue Jul 13 11:38:03 EDT 2021
0.23/0.37	% CPUTime    : 
0.23/0.37	% Number of cores: 8
0.23/0.37	% Python version: Python 3.6.8
0.23/0.37	# Version: 2.6rc1-ho
0.23/0.39	# No SInE strategy applied
0.23/0.39	# Trying AutoSched0 for 59 seconds
12.69/12.85	# AutoSched0-Mode selected heuristic Y1006__C12_02_nc_F1_AE_CS_SP_S2S
12.69/12.85	# and selection function SelectNewComplexAHP.
12.69/12.85	#
12.69/12.85	# Preprocessing time       : 0.077 s
12.69/12.85	# Presaturation interreduction done
12.69/12.85	
12.69/12.85	# Proof found!
12.69/12.85	# SZS status Theorem
12.69/12.85	# SZS output start CNFRefutation
12.69/12.85	thf(fact_3_sortLemmaL, axiom, ![X21:a > int, X51:binary1439146945Tree_a, X52:a, X53:binary1439146945Tree_a]:(binary1721989714Tree_a @ X21 @ (binary717961607le_T_a @ X51 @ X52 @ X53)=>binary1721989714Tree_a @ X21 @ X51), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_sortLemmaL)).
12.69/12.85	thf(fact_1_s, axiom, binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_s)).
12.69/12.85	thf(conj_0, conjecture, binary1721989714Tree_a @ h @ t1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
12.69/12.85	thf(c_0_3, plain, ![X140:a, X139:binary1439146945Tree_a, X53:binary1439146945Tree_a]:(esk1_3 @ X53 @ X139 @ X140)=(binary717961607le_T_a @ X139 @ X140 @ X53), introduced(definition)).
12.69/12.85	thf(c_0_4, plain, ![X1855:a > int, X1856:binary1439146945Tree_a, X1857:a, X1858:binary1439146945Tree_a]:(~binary1721989714Tree_a @ X1855 @ (binary717961607le_T_a @ X1856 @ X1857 @ X1858)|binary1721989714Tree_a @ X1855 @ X1856), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_sortLemmaL])])).
12.69/12.85	thf(c_0_5, plain, ![X2913:a, X2914:binary1439146945Tree_a, X2915:binary1439146945Tree_a]:(esk1_3 @ X2915 @ X2914 @ X2913)=(binary717961607le_T_a @ X2914 @ X2913 @ X2915), inference(variable_rename,[status(thm)],[c_0_3])).
12.69/12.85	thf(c_0_6, plain, ![X5:a, X21:a > int, X24:binary1439146945Tree_a, X51:binary1439146945Tree_a]:(binary1721989714Tree_a @ X21 @ X24|~binary1721989714Tree_a @ X21 @ (binary717961607le_T_a @ X24 @ X5 @ X51)), inference(split_conjunct,[status(thm)],[c_0_4])).
12.69/12.85	thf(c_0_7, plain, ![X5:a, X51:binary1439146945Tree_a, X24:binary1439146945Tree_a]:(esk1_3 @ X24 @ X51 @ X5)=(binary717961607le_T_a @ X51 @ X5 @ X24), inference(split_conjunct,[status(thm)],[c_0_5])).
12.69/12.85	thf(c_0_8, plain, binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2), inference(split_conjunct,[status(thm)],[fact_1_s])).
12.69/12.85	thf(c_0_9, negated_conjecture, ~binary1721989714Tree_a @ h @ t1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
12.69/12.85	thf(c_0_10, plain, ![X51:binary1439146945Tree_a, X24:binary1439146945Tree_a, X21:a > int, X5:a]:(binary1721989714Tree_a @ X21 @ X24|~binary1721989714Tree_a @ X21 @ (esk1_3 @ X51 @ X24 @ X5)), inference(rw,[status(thm)],[c_0_6, c_0_7])).
12.69/12.85	thf(c_0_11, plain, binary1721989714Tree_a @ h @ (esk1_3 @ t2 @ t1 @ x), inference(rw,[status(thm)],[c_0_8, c_0_7])).
12.69/12.85	thf(c_0_12, negated_conjecture, ~binary1721989714Tree_a @ h @ t1, inference(split_conjunct,[status(thm)],[c_0_9])).
12.69/12.85	thf(c_0_13, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12]), ['proof']).
12.69/12.85	# SZS output end CNFRefutation
12.69/12.85	# Proof object total steps             : 14
12.69/12.85	# Proof object clause steps            : 7
12.69/12.85	# Proof object formula steps           : 7
12.69/12.85	# Proof object conjectures             : 3
12.69/12.85	# Proof object clause conjectures      : 1
12.69/12.85	# Proof object formula conjectures     : 2
12.69/12.85	# Proof object initial clauses used    : 4
12.69/12.85	# Proof object initial formulas used   : 3
12.69/12.85	# Proof object generating inferences   : 1
12.69/12.85	# Proof object simplifying inferences  : 3
12.69/12.85	# Training examples: 0 positive, 0 negative
12.69/12.85	# Parsed axioms                        : 390
12.69/12.85	# Removed by relevancy pruning/SinE    : 0
12.69/12.85	# Initial clauses                      : 696
12.69/12.85	# Removed in clause preprocessing      : 69
12.69/12.85	# Initial clauses in saturation        : 627
12.69/12.85	# Processed clauses                    : 2315
12.69/12.85	# ...of these trivial                  : 11
12.69/12.85	# ...subsumed                          : 596
12.69/12.85	# ...remaining for further processing  : 1708
12.69/12.85	# Other redundant clauses eliminated   : 141
12.69/12.85	# Clauses deleted for lack of memory   : 0
12.69/12.85	# Backward-subsumed                    : 63
12.69/12.85	# Backward-rewritten                   : 134
12.69/12.85	# Generated clauses                    : 28476
12.69/12.85	# ...of the previous two non-trivial   : 6281
12.69/12.85	# Contextual simplify-reflections      : 10
12.69/12.85	# Paramodulations                      : 4426
12.69/12.85	# Factorizations                       : 26
12.69/12.85	# NegExts                              : 153
12.69/12.85	# Equation resolutions                 : 180
12.69/12.85	# Propositional unsat checks           : 0
12.69/12.85	#    Propositional check models        : 0
12.69/12.85	#    Propositional check unsatisfiable : 0
12.69/12.85	#    Propositional clauses             : 0
12.69/12.85	#    Propositional clauses after purity: 0
12.69/12.85	#    Propositional unsat core size     : 0
12.69/12.85	#    Propositional preprocessing time  : 0.000
12.69/12.85	#    Propositional encoding time       : 0.000
12.69/12.85	#    Propositional solver time         : 0.000
12.69/12.85	#    Success case prop preproc time    : 0.000
12.69/12.85	#    Success case prop encoding time   : 0.000
12.69/12.85	#    Success case prop solver time     : 0.000
12.69/12.85	# Current number of processed clauses  : 858
12.69/12.85	#    Positive orientable unit clauses  : 84
12.69/12.85	#    Positive unorientable unit clauses: 0
12.69/12.85	#    Negative unit clauses             : 52
12.69/12.85	#    Non-unit-clauses                  : 722
12.69/12.85	# Current number of unprocessed clauses: 4878
12.69/12.85	# ...number of literals in the above   : 60600
12.69/12.85	# Current number of archived formulas  : 0
12.69/12.85	# Current number of archived clauses   : 786
12.69/12.85	# Clause-clause subsumption calls (NU) : 3768344
12.69/12.85	# Rec. Clause-clause subsumption calls : 214408
12.69/12.85	# Non-unit clause-clause subsumptions  : 494
12.69/12.85	# Unit Clause-clause subsumption calls : 18781
12.69/12.85	# Rewrite failures with RHS unbound    : 0
12.69/12.85	# BW rewrite match attempts            : 96
12.69/12.85	# BW rewrite match successes           : 12
12.69/12.85	# Condensation attempts                : 0
12.69/12.85	# Condensation successes               : 0
12.69/12.85	# Termbank termtop insertions          : 8346536
12.69/12.85	
12.69/12.85	# -------------------------------------------------
12.69/12.85	# User time                : 12.436 s
12.69/12.85	# System time              : 0.028 s
12.69/12.85	# Total time               : 12.464 s
12.69/12.85	# Maximum resident set size: 2616 pages
12.69/12.85	EOF